Finding Singular Features

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding Singular Features

We present a method for finding high density, low-dimensional structures in noisy point clouds. These structures are sets with zero Lebesgue measure with respect to the D-dimensional ambient space and belong to a d < D dimensional space. We call them “singular features.” Hunting for singular features corresponds to finding unexpected or unknown structures hidden in point clouds belonging to RD....

متن کامل

Finding Face Features

We describe a computer program which understands a greyscale image of a face well enough to locate individual face features such as eyes and mouth. The program has two distinct components: modules designed to locate particular face features, usually in a restricted area; and the overall control strategy which activates modules on the basis of the current solution state, and assesses and integra...

متن کامل

Finding Relevant Biomolecular Features

Many methods for analyzing biological problems are constrained by problem size. The ability to distinguish between relevant and irrelevant features of a problem may allow a problem to be reduced in size sufficiently to make it tractable. The issue of learning in the presence of large numbers of irrelevant features is an important one in machine learning, and recently, several methods have been ...

متن کامل

Finding features, figuratively.

Object concepts refer to unique clusters of properties that can be selectively activated or inhibited depending on what information is currently relevant. This conceptual "stretching" enables limitless new meanings to be generated, and figurative language provides a useful framework in which to study this conceptual flexibility. Here we probe the cognitive and neural mechanisms underlying the c...

متن کامل

Finding Analogies in Semantic Networks using the Singular Value Decomposition

We present CrossBridge, an algorithm for finding analogies in large, sparse semantic networks. We treat analogies as comparisons between domains of knowledge. A domain is a small semantic network, i.e., a set of concepts and binary relations between concepts. We treat our knowledge base (the large semantic network) as if it contained many domains of knowledge, then apply dimensionality reductio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Graphical Statistics

سال: 2017

ISSN: 1061-8600,1537-2715

DOI: 10.1080/10618600.2016.1260472